Kat Mülkiyetinde Yönetim Planı
نویسندگان
چکیده
منابع مشابه
Automata for KAT Expressions
Kleene algebra with tests (KAT) is a decidable equational system for program verification, that uses both Kleene and Boolean algebras. In spite of KAT ’s elegance and success in providing theoretical solutions for several problems, not many efforts have been made towards obtaining tractable decision procedures that could be used in practical software verification tools. The main drawback of the...
متن کاملKAT and PHL in Coq
In this article we describe an implementation of Kleene algebra with tests (KAT) in the Coq theorem prover. KAT is an equational system that has been successfully applied in program verification and, in particular, it subsumes the propositional Hoare logic (PHL). We also present an PHL encoding in KAT, by deriving its deduction rules as theorems of KAT. Some examples of simple program's formal ...
متن کاملYazılım Mühendisliğinde Performans Yönetimi Ve Otomatik Bellek Yönetim Durumunun İncelenmesi
Özet. Bu bildiride otomatik bellek yönetimi, bellek çöp toplama ve yazılım mühendisliğinin bilgi teknolojileri metodolojilerinden Bilgi Teknolojisi Altyapı Kütüphanesi (ITIL) ve Yetenek Olgunluk Model Entegrasyonu (CMMI) ile olan bağlantıları ele alınmaktadır. Bu bildiride ayrıca, dünyada yazılım mühendisliğinin bir dalı olarak kabul görmüş fakat Türkiye’de gerek akademik gerekse yazılım sektör...
متن کاملFeasibly Reducing KAT Equations to KA Equations
Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean subalgebra. The addition of tests allows one to encode while programs as KAT terms, thus the equational theory of KAT can express (propositional) program equivalenc...
متن کاملGlushkov and Equation Automata for KAT Expressions
Kleene algebra with tests (KAT) is an equational system that extends Kleene algebra, the algebra of regular expressions, and that is specially suited to capture and verify properties of simple imperative programs. In this paper we study two constructions of automata from KAT expressions: the Glushkov automaton (Apos), and a new construction based on the notion of prebase (equation automata, Aeq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ankara Üniversitesi SBF Dergisi
سال: 1967
ISSN: 0378-2921
DOI: 10.1501/sbfder_0000000885